A Study of If-Then-Else Structures in End User Programming
نویسنده
چکیده
Information technology assumed a role of growing importance in organizations during the 1980s. It is no longer used exclusively by small groups of computer specialists; but, rather, office automation and end user computing (EUC) are used by workers at all levels and in all areas of an organization. This study attempts to gain an understanding of factors associated with the use of EUC. The present study is an empirical study, using one end user programming construct (IF-THEN-ELSE). The major findings are: 1) the constraint of human short-term memory has a significant impact on the use of a programming construct, 2) the individual aptitude and personality traits are strongly related to the use of IF-THEN-ELSE constructs, and 3) the format of the construct could also affect the user's performance.
منابع مشابه
The automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملA Multi-Stage Single-Machine Replacement Strategy Using Stochastic Dynamic Programming
In this paper, the single machine replacement problem is being modeled into the frameworks of stochastic dynamic programming and control threshold policy, where some properties of the optimal values of the control thresholds are derived. Using these properties and by minimizing a cost function, the optimal values of two control thresholds for the time between productions of two successive nonco...
متن کاملCTL-RP: A computation tree logic resolution prover
1 procedure eres(T, C) 2 // T is a set of clauses 3 // C is a sometime clause Q ⇒ A♦¬l or Q ⇒ E♦¬l〈LC(ind)〉 4 begin 5 if C is an A-sometime clause then 6 SOS := {D | D is a global or step clause in T}; 7 else if C is an E-sometime clause then 8 SOS := {D | D is a global, A-step, or E-step clause with the index ind in T}; 9 end if 10 i := 0; 11 H−1(x) := true; 12 do 13 Goals := {ls(x) ∨ ¬Ql(app(...
متن کاملManhattan: End-User Programming for Music
This paper explores the concept of end-user programming languages in music composition, and introduces the Manhattan system, which integrates formulas with a grid-based style of music sequencer. Following the paradigm of spreadsheets, an established model of end-user programming, Manhattan is designed to bridge the gap between traditional music editing methods (such as MIDI sequencing and types...
متن کاملOn Hoare-McCarthy algebras
We discuss an algebraic approach to propositional logic with side effects. To this end, we use Hoare’s conditional [1985], which is a ternary connective comparable to if-then-else. Starting from McCarthy’s notion of sequential evaluation [1963] we discuss a number of valuation congruences and we introduce Hoare-McCarthy algebras as the structures that characterize these congruences.
متن کامل